SRAR loops with more than two commutators

Switching with more than two colours

The operation of switching a finite graph was introduced by Seidel, in the study of strongly regular graphs. We may conveniently regard a graph as being a 2-colouring of a complete graph; then the extension to switching of an m-coloured complete graph is easy to define. However, the situation is very different. For m > 2, all m-coloured graphs lie in the same switching class. However, there are...

Asymmetric Auctions with More Than Two Bidders∗

The theoretical literature on asymmetric first-price auctions has focused mainly on settings with either (1) exactly two bidders or (2) an arbitrary number of bidders with types in a common support. Even though closed form solutions are typically impossible, there is enough structure in the problem to guide both empirical work and numerical solutions or simulations. However, casual observation ...

Motion Estimation with More than Two Frames

This paper reports on the development of a general motion estimation system based on using three or more frames. The relevant portion of the sequence is treated as a whole, thus simplifying the process of estimating the motion parameters, and enabling the computation of the motion parameters in terms of the natural center of motion. The paper presents a general description of this motion estima...

Comparing More Than Two Groups

Monitoring Project Progress: More than a series of feedback loops

Early detection that a program is not producing intended outcomes within planned time scales and budgets is of concern to all managers. The processes of monitoring actual progress against planned progress and the subsequent benefits to program management and its impact are often undervalued in program implementation planning. This paper will explore these processes discussing the value of plann...